finite operation

См. также в других словарях:

• Finite set — In mathematics, a set is called finite if there is a bijection between the set and some set of the form {1, 2, ..., n} where n is a natural number. (The value n = 0 is allowed; that is, the empty set is finite.) An infinite set is a set which is… …   Wikipedia

• Finite field arithmetic — Arithmetic in a finite field is different from standard integer arithmetic. There are a limited number of elements in the finite field; all operations performed in the finite field result in an element within that field.While each finite field is …   Wikipedia

• Finite state transducer — A finite state transducer (FST) is a finite state machine with two tapes: an input tape and an output tape. This contrasts with an ordinary finite state automaton (or finite state acceptor), which has a single tape. OverviewAn automaton can be… …   Wikipedia

• Operation (mathematics) — The general operation as explained on this page should not be confused with the more specific operators on vector spaces. For a notion in elementary mathematics, see arithmetic operation. In its simplest meaning in mathematics and logic, an… …   Wikipedia

• Finite potential barrier (QM) — In quantum mechanics, the finite potential barrier is a standard one dimensional problem that demonstrates the phenomenon of quantum tunnelling. The problem consists of solving the time independent Schrödinger equation for a particle with a… …   Wikipedia

• Finite impulse response — Ein Filter mit endlicher Impulsantwort (englisch finite impulse response filter, FIR Filter, oder manchmal auch Transversalfilter genannt) ist ein diskreter, meist digital implementierter Filter und wird im Bereich der digitalen… …   Deutsch Wikipedia

• Finite impulse response filter — Ein Filter mit endlicher Impulsantwort (englisch finite impulse response filter, FIR Filter, oder manchmal auch Transversalfilter genannt) ist ein diskreter, meist digital implementierter Filter und wird im Bereich der digitalen… …   Deutsch Wikipedia

• Event-driven finite state machine — In computation, a finite state machine (FSM) is event driven if the creator of the FSM intends to think of the machine as consuming events or messages. This is in contrast to the parsing theory origins of the term finite state machine where the… …   Wikipedia

• Iterated binary operation — In mathematics, an iterated binary operation is an extension of a binary operation on a set S to a function on finite sequences of elements of S through repeated application. Common examples include the extension of the addition operation to the… …   Wikipedia

• Extended finite state machine — In a conventional finite state machine, the transition is associated with a set of input Boolean conditions and a set of output Boolean functions. In an extended finite state machine (EFSM) model, the transition can be expressed by an “if… …   Wikipedia

• Approximately finite dimensional C*-algebra — In C* algebras, an approximately finite dimensional, or AF, C* algebra is one that is the inductive limit of a sequence of finite dimensional C* algebras. Approximate finite dimensionality was first defined and described combinatorially by… …   Wikipedia